Planning as Satisfiability: Boolean vs non-Boolean encodings
نویسنده
چکیده
Recently, the performance of planners has been increased significantly. Many of the new methods responsible for the speed-up have used SAT-compilation techniques. These methods convert the planning problem specification into a Boolean CNF formula, which is then solved by a range of fast SAT solvers. However, some of the properties of the planning problems can be more concisely expressed using a non-Boolean encoding. This project explores the idea of automatically converting planning problems into non-Boolean CNF formulae, which are then solved by one of two non-Boolean SAT solvers, developed in previous projects. Experimental evidence is presented to show that this approach has significant performance increases over the original Boolean method, for some types of planning problems.
منابع مشابه
Faster Probabilistic Planning through More Efficient Stochastic Satisfiability Problem Encodings
The propositional contingent planner ZANDER solves finitehorizon, partially observable, probabilistic planning problems at state-of-the-art-speeds by converting the planning problem to a stochastic satisfiability (SSAT) problem and solving that problem instead (Majercik 2000). ZANDER obtains these results using a relatively inefficient SSAT encoding of the problem (a linear action encoding with...
متن کاملOptimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the MCM problem optimally. To the best of our knowledge, the proposed encodings and the optimization algorithm are the first formalization of the MCM problem in a PBS manner. This report evaluates the complexity of the prob...
متن کاملA Novel Transition Based Encoding Scheme for Planning as Satisfiability
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from the STRIPS formalism. We introduce a novel SAT encoding scheme based on the SAS+ formalism. It exploits the structural information in the SAS+ formalism, resulting in more compact SAT instances and reducing the number...
متن کاملC-MAXPLAN: Contingent Planning in the MAXPLAN Framework
C-MAXPLAN extends MAXPLAN to include contingent planning in probabilistic propositional domains. Like MAXPLAN, C-MAXPLAN converts the planning problem into an E-MAJSAT instance, a type of probabilistic satisfiability problem in which a set of Boolean variables encodes the plan and a second set of Boolean variables encodes the probabilistic outcome of the plan-the satisfiability problem is to fi...
متن کاملReinforced Encoding for Planning as SAT
Solving planning sss problems via translation to satisfiability (SAT) is one of the most successful approaches to automated planning. We propose a new encoding scheme, called Reinforced Encoding, which encodes a planning problem represented in the SAS+ formalism into SAT. The Reinforced Encoding is a combination of the transition-based SASE encoding with the classical propositional encoding. In...
متن کامل